Equivalence of consequence relations: an order-theoretic and categorical perspective

نویسندگان

  • Nikolaos Galatos
  • Constantine Tsinakis
چکیده

Equivalences and translations between consequence relations abound in logic. The notion of equivalence can be defined syntactically, in terms of translations of formulas, and order-theoretically, in terms of the associated lattices of theories. W. Blok and D. Pigozzi proved in [2] that the two definitions coincide in the case of an algebraizable sentential deductive system. A refined treatment of this equivalence was provided by W. Blok and B. Jónsson in [3] and [4]. Other authors have extended this result to the cases of k-deductive systems and of consequence relations on associative, commutative, classical sequents. Our main result subsumes all existing results in the literature and reveals their common character. The proofs are of order-theoretic and categorical nature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adjunction-Theoretic Foundation for Proof Search in Intuitionistic First-Order Categorical Logic Programming

In this thesis we compose a proof-theoretic approach to logic programming with a category-theoretic approach to proof theory. This allows us to present the computation mechanisms of several systems of logic programming as proof search strategies within an intuitionistic first-order sequent calculus with logic variables and to analyze aspects of their behavior algebraically. Beginning from the b...

متن کامل

FUZZY SUBGROUPS AND CERTAIN EQUIVALENCE RELATIONS

In this paper, we study an equivalence relation on the set of fuzzysubgroups of an arbitrary group G and give four equivalent conditions each ofwhich characterizes this relation. We demonstrate that with this equivalencerelation each equivalence class constitutes a lattice under the ordering of fuzzy setinclusion. Moreover, we study the behavior of these equivalence classes under theaction of a...

متن کامل

Bunched polymorphism

We describe a polymorphic, typed lambda calculus with substructural features. This calculus extends the first-order substructural lambda calculus αλ associated with bunched logic. A particular novelty of our new calculus is the substructural treatment of second-order variables. This is accomplished through the use of bunches of type variables in typing contexts. Both additive and multiplicative...

متن کامل

Quantum Logic in Dagger Kernel Categories

This paper investigates quantum logic from the perspective of categorical logic, and starts from minimal assumptions, namely the existence of involutions/daggers and kernels. The resulting structures turn out to (1) encompass many examples of interest, such as categories of relations, partial injections, Hilbert spaces (also modulo phase), and Boolean algebras, and (2) have interesting categori...

متن کامل

Conceptual Completeness for First-Order Intuitionistic Logic: An Application of Categorical Logic

This paper concerns properties of interpretations between first-order theories in intuitionistic logic, and in particular how certain syntactic properties of such interpretations can be characterised by their model-theoretic properties. We allow theories written in possibly many-sorted languages. Given two such theories 3 and 7, an interpretation of 3 in 3’ will here mean a model of 3 in the ‘f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 74  شماره 

صفحات  -

تاریخ انتشار 2009